Partition function for a singular background

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ω-Background and the Nekrasov Partition Function

In this talk we’ll aim to make sense of the Nekrasov partition function (as introduced in Nekrasov’s ICM address [Nek03]) as the partition function in a twisted deformed N = 2 gauge theory. While making the deformation is unnecessary – without it we’re just talking about the partition function in Donaldson-Witten theory – deforming the theory eliminates IR divergences, allowing a direct mathema...

متن کامل

On open superstring partition function in inhomogeneous rolling tachyon background

We consider open superstring partition function Z on the disc in time-dependent tachyon background T = f(xi)e μx0 where the profile function f depends on spatial coordinates. We compute Z to second order in derivatives of f and compare the result with some previously suggested effective actions depending only on first derivatives of the tachyon field. We also compute the target-space stress-ene...

متن کامل

A Sharp Maximal Function Estimate for Vector-Valued Multilinear Singular Integral Operator

We establish a sharp maximal function estimate for some vector-valued multilinear singular integral operators. As an application, we obtain the $(L^p, L^q)$-norm inequality for vector-valued multilinear operators.

متن کامل

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

A Core Concept for Partition Function Games

In this paper, we introduce a new core concept for partition function games, to be called the strong-core, which reduces to the ordinary core if the worth of every coalition is independent of the partitions to which it belongs and the game is adequately represented by a characteristic function. It is nicely related to previous core concepts, but unlike them does not assume formation of a specif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Letters B

سال: 2005

ISSN: 0370-2693

DOI: 10.1016/j.physletb.2005.02.010